Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case
نویسندگان
چکیده
We consider two coupled queues with a generalized processor sharing service discipline. The second queue has a much smaller Poisson arrival rate than the first queue, while the customer service times are of comparable magnitude. The processor sharing server devotes most of its resources to the first queue, except when it is empty. The fraction of resources devoted to the second queue is small, of the same order as the ratio of the arrival rates. We assume that the primary queue is heavily loaded and that the secondary queue is critically loaded. If we let the small arrival rate to the secondary queue be O ε , where 0 ≤ ε 1, then in this asymptotic limit the number of customers in the first queue will be large, of order O ε−1 , while that in the second queue will be somewhat smaller, of order O ε−1/2 . We obtain a two-dimensional diffusion approximation for this model and explicitly solve for the joint steady state probability distribution of the numbers of customers in the two queues. This work complements that in Morrison, 2010 , which the second queue was assumed to be heavily or lightly loaded, leading to mean queue lengths that were O ε−1 or O 1 , respectively.
منابع مشابه
SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملL. Breuer: Two Examples for Computationally Tractable Periodic Queues Two Examples for Computationally Tractable Periodic Queues
Abstract: In the present paper, the periodic queue is analyzed. This queue has a periodic BMAP arrival process, which is defined in this paper, and exponential service time distributions with service rates varying periodically in time. The transient distribution and several formulae for its efficient computation are derived. Furthermore, a stability condition in terms of arrival and service rat...
متن کاملBatch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times
We analyze the latency or sojourn time L(m,n) for the last customer in a batch of n customers to exit from the m-th queue in a tandem of m queues in the setting where the queues are in equilibrium before the batch of customers arrives at the first queue. We first characterize the distribution of L(m,n) exactly for every m and n, under the assumption that the queues have unlimited buffers and th...
متن کاملUnited Nations Educational Scientific and Cultural Organization INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS OPTIMAL CONTROL OF TWO QUEUES IN SERIES
In this paper we give a fairly complete survey of the available results on the control of arrival and service rates for both single queue and networks of queues. We also study two M/M/l queues in series. At the first queue, the arrival and the service rates are chosen in pair from a finite set whenever the queue lengths at both queues change. Each choice has a switching cost depending on the ch...
متن کاملFinite-Buffer Queues with Workload-Dependent Service and Arrival Rates
We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Operations Research
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011